Reducing Structural Complexity of Software by Data Streams∗
نویسندگان
چکیده
Language architecture is developed from context-free grammar enriched by communication channels. Four types of formal communication channels and one type of informal communication channel are identified for functional languages, to provide a systematic background for human-machine communication. Formal channel positions are determined by a grammar, and informal channels by a programmer. Structural complexity is radically decreased since data streams are approximately as concise as computer machine code, but they are semantically equivalent to high level functional programs. Using simple example of a functional language, we present the principle of functional language architecture and its driving by a data stream. In particular, we show how a program is initially recorded, how it is automatically generated, and how it is adapted to verbose, quiet and collaborative modes. As a result, we propose data stream-oriented architecture, in which structural complexity of current programs is rapidly decreased, since the execution of language architecture machine code means the execution of high-level programs.
منابع مشابه
Measurement of Complexity and Comprehension of a Program Through a Cognitive Approach
The inherent complexity of the software systems creates problems in the software engineering industry. Numerous techniques have been designed to comprehend the fundamental characteristics of software systems. To understand the software, it is necessary to know about the complexity level of the source code. Cognitive informatics perform an important role for better understanding the complexity o...
متن کاملبررسی ابعاد ساختارسازمانی در بیمارستان های عمومی شهرستان یزد با رویکرد مکانیک –
Background: The first important issue underlying any organization is its structure. Among structural factors, complexity, formalization and centralization are more important than others and are considered as main factors. The main purpose of this research is determining structural factors(compelexity, formalization and centralization ) and the preferred structure with a mechanic and organic ap...
متن کاملRamified Structural Recursion and Corecursion
We investigate feasible computation over a fairly general notion of data and codata. Specifically, we present a direct Bellantoni-Cookstyle normal/safe typed programming formalism, RS1 , that expresses feasible structural recursions and corecursions over data and codata specified by polynomial functors. (Lists, streams, finite trees, infinite trees, etc. are all directly definable.) A novel asp...
متن کاملGlobal Software Development: Measuring, Approximating and Reducing the Complexity of Global Software Development Using Extended Axiomatic Design Theory
This paper considers GSD projects as designed artefacts, and proposes the application of an Extended Axiomatic Design theory to reduce their complexity in order to increase the probability of project success. Using an upper bound estimation of the Kolmogorov complexity of the so-called ‘design matrix’ (as a proxy of Information Content as a complexity measure) we demonstrate on two hypothetical...
متن کاملGlobal Software Development: Measuring, Approximating and Reducing the Complexity of Global Software Development Using Extended Axiomatic Design Theory
This paper considers GSD projects as designed artefacts, and proposes the application of an Extended Axiomatic Design theory to reduce their complexity in order to increase the probability of project success. Using an upper bound estimation of the Kolmogorov complexity of the so-called ‘design matrix’ (as a proxy of Information Content as a complexity measure) we demonstrate on two hypothetical...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009